The Tera Multithreaded Architecture and Unstructured Meshes
نویسندگان
چکیده
The Tera Multithrcadcd Architecture (MTA) is a new parallel supcrcomputer currently being installed at San Diego Supercomputing Center (SDSC). This machine has an architecture quite different from contemporary parallel machines. The computational processor is a custom design and the machine uses hardware to support very fine grained multithreading. The main memory is shared, hardware randomized and flat. These features make the machine highly suited to the execution of unstructured mesh problems, which arc difficult to parallclizc on other architectures. Wc report the results of a study carried out during July-August 1998 to evaluate the execution of EUL3D, a code that solves the Euler equations on an unstructured mesh, on the 2 processor Tera MTA at SDSC. Our investigation shows that parallelization of an unstructured code is extremely easy on the Tcra. We were able to get an existing parallel code (designed for a shared memory machine), running on the Tera by changing only the compiler directives. Fhrthermore, a serial version of this code was compiled to run in parallel on the Tera by judicious use of directives to invoke the "full/empty" tag bits of the machine to obtain synchronization. This vcrsion achieves 212 and 406 Mflop/s on one and two processors respectively, and requires no attention to partitioning or placement of data issues that would be of paramount importance in other parallel architectures. Key words, parallel computing, multiprocessors, supcrcomputing, multithreaded architectures, Tcra computer, unstructured meshcs Subject classification. Computer Science
منابع مشابه
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations (PDEs) over a nite region. The process of obtaining numerical solutions to the governing PDEs involves solving large sparse linear or eigen systems over the unstructured meshes that model the underlying physical objects. These systems are often solved iteratively, where the s...
متن کاملParallelization of a Dynamic Unstructured Algorithm Using Three Leading Programming Paradigms
The success of parallel computing in solving real-life computationally-intensive problems relies on their efficient mapping and execution on large-scale multiprocessor architectures. Many important applications are both unstructured and dynamic in nature, making their efficient parallel implementation a daunting task. This paper presents the parallelization of a dynamic unstructured mesh adapta...
متن کاملExplorations in Symbiosis on two Multithreaded Architectures
Symbiosis is de ned as the mutually bene cial living together of two dissimilar organisms in close proximity. We adapt that term to refer to the increase in throughput that can occur when two or more applications are executed concurrently on a multithreaded computer. In this paper, we give a formal de nition of symbiosis, make observations about its nature, and present experimental results on t...
متن کاملExplorations in Symbiosis on two
Symbiosis is deened as the mutually beneecial living together of two dissimilar organisms in close proximity. We adapt that term to refer to the increase in throughput that can occur when two or more applications are executed concurrently on a multithreaded computer. In this paper, we give a formal deenition of symbio-sis, make observations about its nature, and present experimental results on ...
متن کاملSymbiotic Jobscheduling on the Tera MTA
Symbiosis is a term from biology meaning the living together of dissimilar organisms in close proximity. We adapt that term to refer to an increase in throughput that can occur when jobs are coscheduled on multithreaded machines. On a multithreaded machine such as the Tera MTA (Multithreaded Architecture) coscheduled jobs share system resource very intimately on a cycle by cycle basis. This can...
متن کامل